Compact Value-Function Representations for Qualitative Preferences
نویسندگان
چکیده
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation focused on structured models that provide a factored representation of users’ preferences. Such models require less information to construct and support efficient reasoning algorithms. This paper makes two substantial contributions to this area: (1) Strong representation theorems for factored value functions. (2) A methodology that utilizes our representation results to address the problem of optimal item selection.
منابع مشابه
Graphically structured value-function compilation
Classical work on eliciting and representing preferences over multi-attribute alternatives has attempted to recognize conditions under which value functions take on particularly simple and compact form, making their elicitation much easier. In this paper we consider preferences over discrete domains, and show that for a certain class of simple and intuitive qualitative preference statements, on...
متن کاملReasoning With Conditional Ceteris Paribus Preference Statements
In many domains it is desirable to assess the preferences of users in a qualitative rather than quantitative way. Such representations of qualitative preference orderings form an important component of automated decision tools. We propose a graphical representation of preferences that reflects conditional dependence and independence of preference statements under a ceteris paribus (all else bei...
متن کاملRepresentations of Double Coset Lie Hypergroups
We study the double cosets of a Lie group by a compact Lie subgroup. We show that a Weil formula holds for double coset Lie hypergroups and show that certain representations of the Lie group lift to representations of the double coset Lie hypergroup. We characterize smooth (analytic) vectors of these lifted representations.
متن کاملA Variable Elimination Approach for Optimal Scheduling with Linear Preferences
In many practical scheduling problems, feasible solutions can be partially ordered according to differences between the temporal objects in each solution. Often, these orderings can be computed from a compact value function that combines the local preference values of the temporal objects. However, in part because it is natural to view temporal domains as continuous, finding complete, preferred...
متن کاملLocal Geometry of Multiattribute Tradeoff Preferences
Existing preference reasoning systems have been successful in simple domains. Broader success requires more natural and more expressive preference representations. This thesis develops a representation of logical preferences that combines numerical tradeoff ratios between partial outcome descriptions with qualitative preference information. We argue our system is unique among preference reasoni...
متن کامل